Bipartite almost distance-hereditary graphs
نویسندگان
چکیده
منابع مشابه
Almost-bipartite distance-regular graphs with the Q-polynomial property
Let Γ denote a Q-polynomial distance-regular graph with diameter D ≥ 4. Assume that the intersection numbers of Γ satisfy ai = 0 for 0 ≤ i ≤ D − 1 and aD 6= 0. We show that Γ is a polygon, a folded cube, or an Odd graph.
متن کاملOn Computing the Galois Lattice of Bipartite Distance Hereditary Graphs
The class of Bipartite Distance Hereditary (BDH) graphs is the intersection between bipartite domino-free and chordal bipartite graphs. Graphs in both the latter classes have linearly many maximal bicliques, implying the existence of polynomial-time algorithms for computing the associated Galois lattice. Such a lattice can indeed be built in O(m×n) worst case-time for a domino-free graph with m...
متن کاملThe Path-partition Problem in Bipartite Distance-hereditary Graphs
A path partition of a graph is a collection of vertex-disjoint paths that cover all vertices of the graph. The path-partition problem is to find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.
متن کاملOn the Galois Lattice of Bipartite Distance Hereditary Graphs
1 Istituto per le Applicazioni del Calcolo M. Picone, CNR, via dei Taurini 19, 00185 Roma, Italy, e-mail: [email protected] 2 Dipartimento di Ingegneria dell’Impresa, Università di Roma “Tor Vergata”, via del Politecnico 1, 00133 Roma, Italy, e-mail: [email protected] 3 Dipartimento di Scienze Statistiche, Sapienza Università di Roma, piazzale Aldo Moro 5, 00185 Roma, Italy, e-mail...
متن کاملHamiltonian problem on claw-free and almost distance-hereditary graphs
Let G = (V, E) be a connected graph. The distance between two vertices x and y in G, denoted by dG(x, y), is the length of a shortest path between x and y. A graph G is called almost distance-hereditary, if each connected induced subgraph H of G has the property that dH (u, v) ≤ dG(u, v)+ 1 for every pair of vertices u and v in H . We will confirm that every 2-connected, claw-free and almost di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.038